Randomized Scheduling Mechanisms: Assigning Course Seats in a Fair and Efficient Way
نویسندگان
چکیده
منابع مشابه
Strategy-proof and Efficient Fair Scheduling
In this paper, I study dynamic and sequential fair division problems for players with dichotomous preferences and devise a systematic approach of designing efficient, envy-free, and strategy-proof mechanisms for any generic problem. The mechanisms developed here can accommodate common discount factors to represent players’ time preferences between different periods. I also show that the mechani...
متن کاملIt's not fair - evaluating efficient disk scheduling
Storage system designers prefer to limit the maximum queue length at individual disks to only a few outstanding requests, to avoid possible request starvation. In this paper, we evaluate the benefits and performance implications of allowing disks to queue more requests. We show that the average response time in the storage subsystem is reduced when queuing more requests and optimizing (based on...
متن کاملShared Cluster Scheduling: a Fair and Efficient Protocol
In this work we focus on the problem of resource allocation in a shared cluster used for data-intensive scalable computing. Specifically, we target the open-source implementation of the MapReduce framework, Hadoop, and design a new scheduling algorithm that caters both to a fair and efficient utilization of a shared cluster. Our scheduler, labelled FSP, achieves both goals by “focusing” the res...
متن کاملFair and Efficient Packet Scheduling in Wormhole Networks
Most switch architectures for parallel systems are designed to eliminate only the worst kinds of unfairness such as starvation scenarios in which packets belonging to one traffic flow may not make forward progress for an indefinite period of time. However, stricter fairness can lead to a more predictable and better performance, in addition to improving isolation between traffic belonging to dif...
متن کاملOn efficient and fair scheduling in resource-sharing systems
In the context of communication networks and the Internet, resource-sharing systems have been widely studied. In this paper we give an overview of the main results obtained, and the main mathematical techniques used in the analysis of efficient and fair scheduling policies, or, more generally, in the performance evaluation and optimal control of resource-sharing systems. We discuss two main tec...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Production and Operations Management
سال: 2021
ISSN: 1059-1478,1937-5956
DOI: 10.1111/poms.13449